Even poset and a parity result for binary linear code
نویسندگان
چکیده
منابع مشابه
Even poset and a parity result for binary linear code
Let C be a linear binary code, namely a subspace of the space consisting of all binary vectors of a fixed length. A vector in C is maximal provided it has a maximal support among C; a nonzero vector in C is minimal provided it has a minimal support among C \ {0}. We prove that the sum of all maximal vectors of C equals the sum of all minimal vectors of C. In course of this research, we introduc...
متن کاملThe poset structures admitting the extended binary Hamming code to be a perfect code
Brualdi et al. introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Hamming code to be a double-error-correcting perfect P-code. Our study is motivated by this example. In this paper we classify all poset structures which admit the extended binary Hamming code to be a double or triple-error-correcting perfect P-code. © 2004 Elsevier B.V....
متن کاملThe poset structures admitting the extended binary Golay code to be a perfect code
Brualdi et al. [Codes with a poset metric, Discrete Math. 147 (1995) 57–72] introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Golay code to be a 4-error-correcting perfect P-code. In this paper we classify all of the poset structures which admit the extended binary Golay code to be a 4-error-correcting perfect P-code, and show that th...
متن کاملSigned Binary Addition Circuitry with Inherent Even Parity Outputs
A signed binary (SB) addition circuit is presented that always produces an even parity representation of the sum word. The novelty of this design is that no extra check bits are generated or used. The redundancy inherent in a SB representation is further exploited to contain parity information.
متن کاملA Gray Code for the Ideals of a Forest Poset
We present two algorithms for listing all ideals of a forest poset. These algorithms generate ideals in a Gray Code manner; that is, consecutive ideals diier by exactly one element. Both algorithms use storage O(n), where n is the number of elements in the poset. On each iteration, the rst algorithm does a partial traversal of the current ideal being listed and runs in time O(nN), where N is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.02.028